Hamilton Circuits in Hexagonal Grid Graphs
نویسندگان
چکیده
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid points of a regular hexagonal tiling of the plane and edges corresponding to hexagon sides. We show that Hamilton circuit in hexagonal grid graphs is NP-complete.
منابع مشابه
On Resonance Graphs of Catacondensed Hexagonal Graphs: Structure, Coding, and Hamilton Path Algorithm
The vertex set of the resonance graph of a hexagonal graph G consists of 1-factors of G, two 1-factors being adjacent whenever their symmetric difference forms the edge set of a hexagon of G. A decomposition theorem for the resonance graphs of catacondensed hexagonal graph is proved. The theorem intrinsically uses the Cartesian product of graphs. A canonical binary coding of 1-factors of cataco...
متن کاملHamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs
In 2007, Arkin et al. [3] initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we pro...
متن کاملNon-Hamiltonian Holes in Grid Graphs
In this paper we extend general grid graphs to the grid graphs consist of polygons tiling on a plane, named polygonal grid graphs. With a cycle basis satisfied polygons tiling, we study the cyclic structure of Hamilton graphs. A Hamilton cycle can be expressed as a symmetric difference of a subset of cycles in the basis. From the combinatorial relations of vertices in the subset of cycles in th...
متن کاملHexagonal Tilings and Locally C6 Graphs
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle (see [12]). We also show that locally grid graphs, defined in [9, 12], are minors of hexagonal tilings (and by duality of locally C6 graphs) by contraction of a particular perfect matching and deletion of the resulting parallel ed...
متن کاملHexagonal vs. Rectilinear Grids for Explicit Finite Difference Schemes for the Two-dimensional Wave Equation
Finite difference schemes for the 2-D wave equation operating on hexagonal grids and the accompanying numerical dispersion properties have received little attention in comparison to schemes operating on rectilinear grids. This paper considers the hexagonal tiling of the wavenumber plane in order to show that the hexagonal grid is a more natural choice to emulate the isotropy of the Laplacian op...
متن کامل